Mixed searching and proper-path-width
نویسندگان
چکیده
منابع مشابه
Directed Path-width and Monotonicity in Digraph Searching
Directed path-width was defined by Reed, Thomas and Seymour around 1995. The author and P. Hajnal defined a cops-and-robber game on digraphs in 2000. We prove that the two notions are closely related and for any digraph D, the corresponding graph parameters differ by at most one. The result is achieved using the mixed-search technique developed by Bienstock and Seymour. A search is called monot...
متن کاملSearching Proper Names in Databases
Identifying names — e.g., author names or company names — is still an open problem. In this paper we review known similarity measures. These measures deal with phonetic similarity, typing errors and plain string similarity. We show experimentally that all three approaches lead to significant better retrieval quality than plain identity. Furthermore, we demonstrate that combinations of different...
متن کاملA Note on Tree-width Path-width and Cutwidth*
Let tw(G), pw(G), c(G), !J.(G) denote, respectively, the tree-width, path-width, cutwidth and the maximum degree of a graph G on 11 vertices . It is known that c (G)~tw (G). We prove that c (G) =0 (tw (G)·!J.(G)·logn), and if ({Xj : iel] ,T=(I,A» is a tree decomposition of G with tree-wid~ then c (G) S (k+ l)·!J.(G)·c (T). In case that a tree decomposition is given, or that the tree-width is bo...
متن کاملInstruction Sets Mixed - Width
A pplications written for the embedded domain must perform under the constraints of limited memory and limited energy. While these constraints have always existed, current trends, such as mobile computing and ubiquitous computing, bring more and more complex applications to the embedded domain, making performance, or speed of execution, an important factor as well. For instance, we are now able...
متن کاملFaster Computation of Path-Width
Tree-width and path-width are widely successful concepts. Many NP-hard problems have efficient solutions when restricted to graphs of bounded tree-width. Many efficient algorithms are based on a tree decomposition. Sometimes the more restricted path decomposition is required. The bottleneck for such algorithms is often the computation of the width and a corresponding tree or path decomposition....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00160-k